Strongly countable dimensional compacta form the Hurewicz set
نویسندگان
چکیده
منابع مشابه
Irreducible representations of metrizable spaces and strongly countable-dimensional spaces
We generalize Freudenthal’s theory of irreducible representations of metrizable compacta by inverse sequences of compact polyhedra to the class of all metrizable spaces. Our representations consist of inverse sequences of completely metrizable polyhedra which are ANR’s. They are extendable: any such representation of a closed subspace of a given metrizable space extends to another such of the e...
متن کاملThe Largest Countable Inductive Set is A Mouse Set
Let R be the least ordinal such that L (R) is admissible. Let A = fx 2 R j (9 < R) s.t. x is ordinal deenable in L (R) g. It is well known that (assuming determinacy) A is the largest countable inductive set of reals. Let T be the theory: ZFC Replacement + \There exists ! Woodin cardinals which are coonal in the ordinals." T has consistency strength weaker than that of the theory ZFC + \There e...
متن کاملThe Hurewicz Theorem
The fundamental group and homology groups both give extremely useful information, particularly about path-connected spaces. Both can be considered as functors, so we can use these constructional invariants as convenient guides to classifying spaces. However, though homology groups are often easy to compute, the fundamental group sometimes is not. In fact, it is often not even obvious when a spa...
متن کاملLimited Set quantifiers over Countable Linear Orderings
In this paper, we study several sublogics of monadic secondorder logic over countable linear orderings, such as first-order logic, firstorder logic on cuts, weak monadic second-order logic, weak monadic second-order logic with cuts, as well as fragments of monadic secondorder logic in which sets have to be well ordered or scattered. We give decidable algebraic characterizations of all these log...
متن کاملMenger's Theorem for a Countable Source Set
Paul Erd} os has conjectured that Menger's theorem extends to innnite graphs in the following way: whenever A; B are two sets of vertices in an innnite graph, there exist a set of disjoint A{B paths and an A{B separator in this graph so that the separator consists of a choice of precisely one vertex from each of the paths. We prove this conjecture for graphs that contain a set of disjoint paths...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Topology and its Applications
سال: 2007
ISSN: 0166-8641
DOI: 10.1016/j.topol.2005.02.015